1896C - Matching Arrays - CodeForces Solution

/* Garvit Gupta*/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<algorithm>
#include<unordered_map>
#include<vector>
#include<unordered_set>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<map>
#include<chrono>
using namespace std;
using namespace __gnu_pbds;
using namespace chrono;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

#define debug(x) cout << #x << " " << x <<endl;
#define MOD1 998244353
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define set_bits(x) __builtin_popcount(x)
#define all(x) (x).begin(),(x).end()


// #define int long long
#define ll long 
// typedef unsigned long long ull;
typedef long double lld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update > pbds;
//find_by_order,order_of_key where order is the index
/*---------------------------------------------------------------------------------------------------------------------------*/
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll expo(ll a, ll b, ll mod) {ll res = 1; while (b > 0) {if (b & 1)res = (res * a) % mod; a = (a * a) % mod; b = b >> 1;} return res;}
void extendgcd(ll a, ll b, ll*v) {if (b == 0) {v[0] = 1; v[1] = 0; v[2] = a; return ;} extendgcd(b, a % b, v); ll x = v[1]; v[1] = v[0] - v[1] * (a / b); v[0] = x; return;} //pass an arry of size 3
ll mminv(ll a, ll b) {ll arr[3]; extendgcd(a, b, arr); return arr[0];} //for non prime b
ll mminvprime(ll a, ll b) {return expo(a, b - 2, b);}
bool revsort(ll a, ll b) {return a > b;}
void swap(int &x, int &y) {int temp = x; x = y; y = temp;}
ll combination(ll n, ll r, ll m, ll* fact) {ll val1 = fact[n]; ll val2 = mminvprime(fact[r], m); ll val3 = mminvprime(fact[n - r], m); return ((val1 * val2) % m * val3) % m;}
void google(int t) {cout << "Case #" << t << ": ";}
vector<int> sieve(int n) {int*arr = new int[n + 1](); vector<int> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}
/*--------------------------------------------------------------------------------------------------------------------------*/
void solve(){
    int t;
    cin>>t;
    while(t--){
        int n,x;
        cin>>n>>x;

        pair<int,int> a[n];
        for(int i=0;i<n;i++){
            int b;
            cin>>b;
            a[i]={b,i};
        }
        vector<int> b(n,0);
        for(int i=0;i<n;i++){
            cin>>b[i]; 
        }
        vector<int> ans(n,0);
        int ind=0;//a ke akhri wale choose karenge aur b ke starting wale tabhi a>b sure hoga 
        sort(a,a+n);
        sort(b.begin(),b.end());
        for(int i=n-x;i<n;i++){
            ans[a[i].second]=b[ind];
            ind++;
        }
        for(int i=0;i<n-x;i++){
            ans[a[i].second]=b[ind];
            ind++;
        }
        for(int i=0;i<n;i++){
            if(a[i].first > ans[a[i].second]){
                x--;
            }
        }
        if (x)
            cout << "NO\n";
        else {
            cout << "YES\n";
            for (int x : ans)
                cout << x << ' ';
            cout << '\n';
        }

        

    } 
}

int32_t main()
{
    fastio();
    auto start1 = high_resolution_clock::now();
    solve();
    auto stop1 = high_resolution_clock::now();
    auto duration = duration_cast<microseconds>(stop1 - start1);
#ifndef ONLINE_JUDGE
    cerr << "Time: " << duration.count() / 1000.0 << endl;
#endif
    return 0;
}